D-finite Symmetric Functions
نویسنده
چکیده
The fruitful relation between the theory of symmetric functions and that of D-finite power series was first introduced by Goulden and Jackson in 1980, and later extended by Gessel, who stated two important results that provide closure properties of D-finite symmetric series under the scalar and inner products. These products are very important from the computational and combinatorial points of view, as a prime tool for coefficient extraction in symmetric series. Gessel presented some enumerative problems that can be better understood using his results on D-finiteness. We connect these notions with Scharf, Thibon and Wybourne’s results on reduced Kronecker products. Also, we extend the necessary conditions on one of Gessel’s theorems and determine some consequences in Young Tableaux enumeration.
منابع مشابه
Buckling Behaviors of Symmetric and Antisymmetric Functionally Graded Beams
The present study investigates buckling characteristics of both nonlinear symmetric power and sigmoid functionally graded (FG) beams. The volume fractions of metal and ceramic are assumed to be distributed through a beam thickness by the sigmoid-law distribution (S-FGM), and the symmetric power function (SP-FGM). These functions have smooth variation of properties across the boundary rather tha...
متن کاملEffective scalar products of D-finite symmetric functions
Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has outlined a large class of symmetric functions for which the resulting generating functions are D-finite. We extend Gessel’s work by providing algorithms that compute differential equations these generating functions sa...
متن کاملThe Orchard relation of a generic symmetric or antisymmetric function
We associate to certain symmetric or antisymmetric functions on the set ( E d+1 ) of (d+ 1)−subsets in a finite set E an equivalence relation on E and study some of its properties. 1 Definitions and main results We consider a finite set E and denote by (E d ) the set of subsets containing exactly d elements of E. In the sequel we move often freely from sets to sequences: we identify a subset {x...
متن کاملKronecker Product Identities from D-finite Symmetric Functions
Using an algorithm for computing the symmetric function Kronecker product of D-finite symmetric functions we find some new Kronecker product identities. The identities give closed form formulas for trace-like values of the Kronecker product. Introduction In the process of showing how the scalar product of symmetric functions can be used for enumeration purposes, Gessel [3], proved that this pro...
متن کاملMinimizing Symmetric Set Functions Faster
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set S minimizing d(S,V \ S). This includes the possibility for the minimization of symmetric submodular functions. The presented algorithm requires at most as much time as the one in [Riz00], but depending on the function...
متن کامل